Recognizing a Scenario by Calculating a Temporal Proximity Index between Constraint Graphs
نویسندگان
چکیده
In this paper, the recognition of temporal scenarios is expressed by the mean of a proximity between a scenario which represents a possible system’s behavior and a session which describes the observed behaviour. This recognition is qualified with a proximity index which allows to classify on-line or out-line the scenarios candidates for an evolution’s explanation. This approach, when used in a dynamic system’s supervision or diagnostic task opens possibilities in using or learning scenarios or even in structurating the scenarios. Key-words : scenarios, temporal reasonning, graphs, constraint satisfaction.
منابع مشابه
Scenario recognition for temporal reasoning in medical domains
The recognition of high level clinical scenes is fundamental in patient monitoring. In this paper, we propose a technique for recognizing a session, i.e. the clinical process evolution, by comparison against a predetermined set of scenarios, i.e. the possible behaviors for this process. We use temporal constraint networks to represent both scenario and session. Specific operations on networks a...
متن کاملNew bounds on proximity and remoteness in graphs
The average distance of a vertex $v$ of a connected graph $G$is the arithmetic mean of the distances from $v$ to allother vertices of $G$. The proximity $pi(G)$ and the remoteness $rho(G)$of $G$ are defined as the minimum and maximum averagedistance of the vertices of $G$. In this paper we investigate the difference between proximity or remoteness and the classical distanceparameters diameter a...
متن کاملOptimal Coding Subgraph Selection under Survivability Constraint
Nowadays communication networks have become an essential and inevitable part of human life. Hence, there is an ever-increasing need for expanding bandwidth, decreasing delay and data transfer costs. These needs necessitate the efficient use of network facilities. Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets recei...
متن کاملCalculating Different Topological Indices of Von Neumann Regular Graph of Z_(p^α )
By the Von Neumann regular graph of R, we mean the graph that its vertices are all elements of R such that there is an edge between vertices x,y if and only if x+y is a von Neumann regular element of R, denoted by G_Vnr (R). For a commutative ring R with unity, x in R is called Von Neumann regular if there exists x in R such that a=a2 x. We denote the set of Von Neumann regular elements by V nr...
متن کاملThe Impacts of Monetary Policy on Macroeconomic Variables Assuming the Collateral Constraint
This study aimed to examine the effects of monetary policy on macroeconomic variables with regard to the collateral constraint. For this purpose, a dynamic stochastic general equilibrium (DSGE) was developed for Iran’s economic status. Two scenarios were considered as to account for the behavior of the central bank. In the first scenario, the monetary rule is modeled according to the GDP gap an...
متن کامل